Complete-factors and f-factors

Complete-factors and (g, f)-covered graphs

proficiency level and factors fostering reticence in efl learners

according to cheng (1999), in recent esl/efl literature, asian (especially east asian) learners of english as a foreign/second language have been arguably reported as reticent and passive learners. the most common allegations are that these students are reluctant to participate in classroom discourse; they are unwilling to give responses; they do not ask questions; and they are passive and over...

Comparisons of F factors and R factors: existence of independent regulation groups in F factors.

The similarity of sex pili mediated by F factors and R(fi(+)) factors and the ability of R(fi(+)) factors to control by repression the functioning of pilus genes encoded by the F factor suggested that F factors and R(fi(+)) factors are closely related. Further comparisons of the episomal properties of F factors and R(fi(+)) factors, however, indicated many differences. F factors contain informa...

Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers

In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...

Binding numbers and f-factors of graphs

Let G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, and f : V (G) → {a, a + 1, . . . , b} be a function such that ∑ (f(x);x ∈ V (G)) ≡ 0(mod2). We prove the following two results: (i) If the binding number of G is greater than (a+b−1)(n−1)/(an−(a+b)+3) and n ≥ (a+b)2/a, then G has an f factor; (ii) if the minimum degree of G is greater than (bn−2)/(a+b), an...